Minimal manipulability: anonymity and unanimity
نویسندگان
چکیده
This paper is concerned with the minimal number of profiles at which a unanimous and anonymous social choice function is manipulable. The lower bound is derived when there are three alternatives to choose from. Examples of social choice functions attaining the lower bound are given. We conjecture that these examples are in fact all minimally manipulable social choice functions. Since some of these examples are even Pareto optimal, we have also derived the lower bound for Pareto optimal and anonymous social choice functions. Some of the minimally manipulable Pareto optimal and anonymous social choice functions can be interpreted as status quo voting.
منابع مشابه
Anonymous voting and minimal manipulability
We compare the manipulability of different choice rules by considering the number of manipulable profiles. We establish the minimal number of such profiles for tops-only, anonymous, and surjective choice rules, and show that this number is attained by unanimity rules with status quo.
متن کاملSequential aggregation judgments: Logical derivation of relevance relation
Following Dietrich (2014) we consider using choice by plurality voting (CPV) as a judgment aggregation correspondence. We notice that a result of Roberts (1991) implies that CPV is axiomatically characterized by anonymity, neutrality, unanimity, and (Young’s) reinforcement. Following List (2004) and Dietrich (2015) we construct a sequential voting procedure of judgement aggregation which satisf...
متن کاملA characterization of plurality-like rules based on non-manipulability, restricted efficiency, and anonymity
A society needs to decide which issues (laws, public projects, public facilities, etc.) in an agenda to accept. The decision can be any subset of the agenda but must reflect the preferences of its members, which are assumed to be “separable weak orderings”. We characterize a family of plurality-like rules based on strategy-proofness, restricted efficiency, anonymity, and two weak axioms pertain...
متن کاملTopological aggregation, the twin paradox and the no show paradox
Consider the framework of topological aggregation introduced by Chichilnisky (1980). We prove that in this framework the Twin Paradox and the No Show Paradox cannot be avoided. Anonymity and unanimity are not needed to obtain these results.
متن کاملAnnexations and Merging in Weighted Voting Games - The Extent of Susceptibility of Power Indices
This paper discusses weighted voting games and two methods of manipulating those games, called annexation and merging. These manipulations allow either an agent, called an annexer to take over the voting weights of some other agents in the game, or the coming together of some agents to form a bloc of manipulators to have more power over the outcomes of the games. We evaluate the extent of susce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Social Choice and Welfare
دوره 29 شماره
صفحات -
تاریخ انتشار 2007